Revising hull and box
نویسندگان
چکیده
منابع مشابه
Revising Hull and Box Consistency
Most interval-based solvers in the constraint logic programming framework are based on either hull consistency or box consistency (or a variation of these ones) to narrow domains of variables involved in continuous constraint systems. This paper first presents HC4, an algorithm to enforce hull consistency without decomposing complex constraints into primitives. Next, an extended definition for ...
متن کاملInvestigation of stepped planning hull hydrodynamics using computational fluid dynamics and response surface method
The use of step at the bottom of the hull is one of the effective factors in reducing the resistance and increasing the stability of the Planning hull. The presence of step at the bottom of this type of hulls creates a separation in the flow, which reduces the wet surface on the hull, thus reducing the drag on the body, as well as reducing the dynamic trim. In this study, a design space was cre...
متن کاملComputational Geometry On The OTIS-Mesh Optoelectronic Computer
We develop efficient algorithms for problems in computational geometry—convex hull, smallest enclosing box, ECDF, two-set dominance, maximal points, all-nearest neighbor, and closest-pair—on the OTIS-Mesh optoelectronic computer. We also demonstrate the algorithms for computing convex hull and prefix sum with condition on a multi-dimensional mesh, which are used to compute convex hull and ECDF ...
متن کاملComputable representations for convex hulls of low-dimensional quadratic forms
Let C be the convex hull of points { (1 x )(1 x )T |x ∈ F ⊂ <n}. Representing or approximating C is a fundamental problem for global optimization algorithms based on convex relaxations of products of variables. If n ≤ 4 and F is a simplex then C has a computable representation in terms of matrices X that are doubly nonnegative (positive semidefinite and componentwise nonnegative). If n = 2 and ...
متن کاملComputational Geometry on Optical Multi-Trees (OMULT) Computer System
This paper presents simple and efficient algorithms for fundamental computational geometry problems on OMULT (Optical Multi-Trees) system [5] that uses both electronic and optical links among processors. We show that the algorithms for convex hull and the smallest enclosing box can be computed on this network in O(log n) time, compared to O( √ n) algorithms on the OTISMesh[6] for each of these ...
متن کامل